The non-existence of certain regular graphs of girth 5
نویسندگان
چکیده
منابع مشابه
The non-existence of certain regular graphs of girth 5
Letf‘(k, g) be the minimum number of vertices that a graph with valency k and girth g can have. The results of Hoffman and Singleton [3] included f(k. 5) > k* + 1 for all k. except k = 2, 3, 7, 57 (it is unknown if the statement is true for k = 57). Brown proved in [2] that f(k, 5) > k2 + 2 for all k with the above exceptions; this statement is contained in a far more general theorem that has r...
متن کاملRegular Graphs of given Girth
Graph theory is the study of mathematical structures called graphs. We define a graph as a pair (V,E), where V is a nonempty set, and E is a set of unordered pairs of elements of V . V is called the set of vertices of G, and E is the set of edges. Two vertices a and b are adjacent provided (a, b) ∈ E. If a pair of vertices is adjacent, the vertices are referred to as neighbors. We can represent...
متن کاملFamilies of small regular graphs of girth 5
In this paper we obtain (q + 3)–regular graphs of girth 5 with fewer vertices than previously known ones for q = 13, 17, 19 and for any prime q ≥ 23 performing operations of reductions and amalgams on the Levi graph Bq of an elliptic semiplane of type C. We also obtain a 13–regular graph of girth 5 on 236 vertices from B11 using the same technique.
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولThe Non-Existence of certain Regular Generalized Polygons
We define the notion of d i -regularity and regularity in generalized polygons, thus generalizing the notion of ‘regular point’ in a generalized quadrangle or hexagon. We show that a thick generalized polygon cannot contain too many regular points unless it is a projective plane, quadrangle or hexagon. For certain polygons (thick ‘odd’gons and 8-gons), we show that even a certain number of d2-r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1981
ISSN: 0095-8956
DOI: 10.1016/0095-8956(81)90045-9